An optimal greedy routing algorithm for triangulated polygons
نویسندگان
چکیده
منابع مشابه
An Optimal Algorithm for Roundness Determination on Convex Polygons
In tolerancing, the Out-Of-Roundness factor determines the relative circularity of planar shapes. The measurement of concern in this work is the Minimum Radial Separation, as recommended by the American National Standards Institute (ANSI). Here we show that the algorithm given in Le and Lee [6] runs in /9(n 2) time even for convex polygons. Furthermore, we present an optimal O(n) time algorithm...
متن کاملAn Optimal Algorithm for Finding the Separation of Simple Polygons
Abs t rac t . Given simple polygons P and Q, their separagion, denoted by a(P, Q), is defined to be the minimum distance between their boundaries. We present an optimal O(N) algorithm for determining the separation of two simple polygons P and Q, where [P[ § [Q[ = [N[. The best previous algorithm for this problem is due to Kirkpatrick and has complexity O(N log N). In addition, a parallel versi...
متن کاملA Greedy Algorithm for Optimal Recombination
Let Σ be an alphabet and Σ denote the collection of all sequences of length n over Σ. For any s1 = a1a2 · · · ajaj+1 · · · an, s2 = b1b2 · · · bj bj+1 · · · bn ∈ Σ, a recombination of s1 and s2 at position j is defined as an operation that crosses s1 and s2 at position j and generates t1 = a1a2 · · · ajbj+1 · · · bn and t2 = b1b2 · · · bjaj+1 · · · an. DenoteA and S two collections of sequences...
متن کاملAn optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
Let P and Q be two disjoint rectilinear polygons in the plane. We say P and Q are in Case 1 if there exists a rectilinear line segment to connect them; otherwise, we say they are in Case 2. In this paper, we present optimal algorithms for solving the following problem. Given two disjoint rectilinear polygons P and Q in the plane, we want to add a rectilinear line segment to connect them when th...
متن کاملA general greedy channel routing algorithm
Abstmt-This paper presents a new channel routing algorithm which assigns wires track by track in a greedy way. The simple underlying data structures and strategy used in this algorithm can be generalized to obtain a class of heuristic channel routing algorithms. The proposed new algorithm has a backtracking capability to increase the chance of completing the routing with a minimum number of tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.02.002